Meta-circular interpreter for a strongly typed language
نویسندگان
چکیده
منابع مشابه
HeDLa: A Strongly Typed, Component-Based Embedded Hardware Description Language
Over the past years, various techniques for the embedding of hardware description languages within general purpose languages have been developed and explored. In particular, numerous HDLs embedded in strongly typed functional languages have been developed and used for different applications. A common trait of most of these languages is that they treat hardware components as functions or relatio...
متن کاملA Meta-Language for Typed Object-Oriented Languages
In [13] we defined the λ&-calculus, a simple extension of the typed λcalculus to model typed object-oriented languages. This paper is the continuation or, rather, the companion of [13] since it analyzes the practical counterpart of the theoretical issues introduced there. Indeed, to develop a formal study of type systems for object-oriented languages we define a meta-language based on λ& and we...
متن کاملCML: A Meta-Interpreter for Manufacturing
Introduction The development of advanced robotics brought expectations of increased productivity and quality control, but to everyone’s disappointment, these expectations still have not been realized. Advanced stand-alone machines have not greatly improved productivity, and integrating large systems has been prohibitively expensive. What is worse, the few integration projects that have been und...
متن کاملInterpreter Veri cation for a Functional Language
Starting from a denotational and a term rewriting based op erational semantics an interpreter for a small functional language we present a correctness proof of the interpreter w r t the denotational se mantics The complete proof has been formalized in the logic LCF and checked with the theorem prover Isabelle Based on this proof conclu sions for mechanical theorem proving in general are drawn
متن کاملStrongly Typed Genetic Programming
Genetic programming is a powerful method for automatically generating computer programs via the process of natural selection (Koza, 1992). However, in its standard form, there is no way to restrict the programs it generates to those where the functions operate on appropriate data types. In the case when the programs manipulate multiple data types and contain functions designed to operate on par...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 1989
ISSN: 0747-7171
DOI: 10.1016/s0747-7171(89)80066-5